Prover and Verifier Based Password Protection: PVBPP
نویسندگان
چکیده
In today's world password are mostly used for authentication. This makes them prone to various kinds of attacks like dictionary attacks. A dictionary attack is a method of breaking the password by systematically entering every word in a dictionary as a password. This attack leads to an overload on the server leading to denial of service attack. This paper presents a protocol to reduce the rate of dictionary attack by using a prover and a verifier system. This system makes it difficult for the attacker to prove it as a valid user by becoming computationally intensive. The rate of attempts is also reduced and thus restricting the Denial of Service attack.
منابع مشابه
Quantum password authentication against man-in-the-middle attack
Authentication with recently proposed quantum password protocol is secure against impersonation. Here we show that original version of the protocol is not secure against active malicious prover and verifier, however a slight modification provides a possibility for a legitimate party to detect the attacks. The password is reusable in the absence of the attacks. Otherwise the security of the auth...
متن کاملPart 3 Petr Jančar
(E.g. in [5], [3].) When we prove a (mathematical) assertion, the proof usually contains more information (and provides a deeper insight) than the plain fact that the assertion is true; this is also (usually) desirable. But there are contexts where a party, say Peggy [or Prover], should show to another party, say Victor [Verifier], that she has a secret piece of knowledge (like a password allow...
متن کاملSound Proof of Proximity of Knowledge
Public-key distance bounding schemes are needed to defeat relay attacks in payment systems. So far, only five such schemes exist, but fail to fully protect against malicious provers. In this paper, we solve this problem. We provide a full formalism to define the proof of proximity of knowledge (PoPoK). Protocols should succeed if and only if a prover holding a secret is within the proximity of ...
متن کاملProof of Proximity of Knowledge
Public-key distance bounding schemes are needed to defeat relay attacks in payment systems. So far, only two such schemes exist, but fail to fully protect against malicious provers. In this paper, we solve this problem. We provide a full formalism to define the proof of proximity of knowledge (PoPoK). Protocols should succeed if and only if a prover holding a secret is within the proximity of t...
متن کاملUser Authentication Scheme Using Individual Auditory Pop-Out
This paper presents a user authentication scheme which takes advantage of the uniqueness of prover’s auditory characteristics. In this scheme, several audio stimuli are presented at the same time by headphone. The stimuli include a special audio stimulus that only the genuine prover can easily distinguishes from other stimuli because of the uniqueness of auditory characteristics. The prover is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1212.6059 شماره
صفحات -
تاریخ انتشار 2012